Asymmetric cubature formulas for polynomial integration in the triangle and square
نویسنده
چکیده
We present five new cubature formula in the triangle and square for exact integration of polynomials. The points were computed numerically with a cardinal function algorithm which does not impose any symmetry requirements on the points. Cubature formula are presented which integrate degrees 10, 11 and 12 in the triangle and degrees 10 and 12 in the square. They have positive weights, contain no points outside the domain, and have fewer points than previously known results. © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Discrete Fourier Analysis, Cubature, and Interpolation on a Hexagon and a Triangle
Several problems of trigonometric approximation on a hexagon and a triangle are studied using the discrete Fourier transform and orthogonal polynomials of two variables. A discrete Fourier analysis on the regular hexagon is developed in detail, from which the analysis on the triangle is deduced. The results include cubature formulas and interpolation on these domains. In particular, a trigonome...
متن کاملNear-optimal interpolation and quadrature in two variables: the Padua points∗
The Padua points are the first known example of optimal points for total degree polynomial interpolation in two variables, with a Lebesgue constant increasing like log of the degree; cf. [1, 2, 3]. Moreover, they generate a nontensorial Clenshaw-Curtis-like cubature formula, which turns out to be competitive with the tensorial Gauss-Legendre formula and even with the few known minimal formulas ...
متن کاملCubature of Integrands Containing Derivatives
We present a new technique for the numerical integration over R a square or triangle of an integrand of the form ru B rv This uses only function values of u B and v avoiding ex plicit di erentiation but is suitable only when the integrand function is regular over R The technique is analogous to Romberg integration since it is based on using a sequence of very simple discretiza tions J m m of th...
متن کاملObtaining Cubatures for Rectangles and Other Planar Regions by Using Orthogonal Polynomials*
A. H. Stroud has recently shown the existence of cubature formulas for planar regions which use m2 points and have polynomial precision 2m — 1. In this paper, the author gives sufficient conditions for the existence of formulas using fewer than m2 points, and having polynomial precision 2m — 1. An algorithm is given for computing such formulas, and is shown to be useful in a more general settin...
متن کاملExistence of Gaussian cubature formulas
We provide a necessary and sufficient condition for existence of Gaussian cubature formulas. It consists of checking whether some overdetermined linear system has a solution and so complements Mysovskikh’s theorem which requires computing common zeros of orthonormal polynomials. Moreover, the size of the linear system shows that existence of a cubature formula imposes severe restrictions on the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008